package leecode

func findMaximumXOR(nums []int) (result int) {
	for i := 0; i < len(nums); i++ {
		for j := i + 1; j < len(nums); j++ {
			result = max(result, nums[i]^nums[j])
		}
	}
	return result
}
